Weighted Polynomial Approximation on the Integers

نویسنده

  • B. A. TAYLOR
چکیده

We prove here some polynomial approximation theorems, somewhat related to the Szasz-Mfintz theorem, but where the domain of approximation is the integers, by dualizing a gap theorem of C. l ~ Y I for periodic entire functions. In another Paper [7], we shall prove, by similar means, a completeness theorem ibr some special sets of entire functions. I t is well known (see, for example [l]) tha t i f E is the space of all entire functions in the topology of uniform convergence on compact sets, then the dual space of continuous complex-valued linear functionals on E may be represented as E0, the space of entire functions of exponential type. Now let E (1) b e the space of entire functions of period 1. Then it may be shown that the dual of E (1) can be represented as E0 (l), where E0(1) is the following quotient space of E0: define / ~ g for functions 1, g e E0 i f / _ g is a multiple of sin z~z, and let E0 (l) be the space of equivalence classes of E0 modulo this relation of equivalence. Now E0(1) is apparent ly the same space as the space of restrictions of functions in E0 to the integers Z. Each such restriction is just a two-sided sequence of complex numbers, of at most exponential growth. ConVersely, it is easy to interpolate any such sequence by an entire function of exponential type. Thus, the dual of E(1) is just the space of all such sequences. Actually, we establish this identification by another procedure. To any theorem about periodic entire functions will correspond a theorem about the space of sequences described above. In [6], C. RI~NYI proved an interesting gap theorem, reproduced below. We show by means of duality tha t certain theorems of polynomial approximation are equivalent to this theorem. The domain of approximation is the integers in one case, and the positive integers in another ease. To our knowledge, the problem of polynomial approximation on the integers has not been Considered except in the note [3]. We know of no direct proof of our results. Ultimately, the R ~ Y I result depends on a simple application of Rolle's theorem. I t Would be of interest to have more precise gap theorems than the R~NYr theorem and also to have direct proofs of the results we prove by means of it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators

In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Maximum dispersion problem in dense graphs

In this note, we present a polynomial-time approximation scheme for a “dense case” of dispersion problem in weighted graphs, where weights on edges are integers from {1; : : : ; K} for some xed integer K . The algorithm is based on the algorithmic version the regularity lemma. c © 2000 Published by Elsevier Science B.V. All rights reserved.

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Approximate Polynomial GCD over Integers with Digits-wise Lattice

For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005